Connected k-factors in bipartite graphs

نویسندگان

چکیده

Let k,? be two positive integers. An Sk,? is a graph obtained from disjoint K1,k and K1,? by adding an edge between the k-degree vertex in ?-degree K1,?. Sk,?-free containing no induced subgraph isomorphic to Sk,?. In this paper, we show that, for any integers with 2?k??, there exists constant c=c(k,?) such that every connected balanced bipartite minimum degree at least c contains k-factor.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Bipartite Toughness and k-Factors in Bipartite Graphs

1 School of Mathematics and System Sciences, Shandong University, Jinan 250100, China 2 Department of Computer Science, Memorial University of Newfoundland, St. John’s, NL, Canada A1B 3X5 3 School of Computing, The University of Southern Mississippi, Hattiesburg, MS 39406, USA 4 Department of Mathematics, College of Arts and Sciences, The State University of West Georgia, Carrollton, GA 30118, USA

متن کامل

Subdivisions of large complete bipartite graphs and long induced paths in k-connected graphs

It is proved that for every positive integers k, r and s there exists an integer n = n(k, r, s) such that every k-connected graph of order at least n contains either an induced path of length s or a subdivision of the complete bipartite graph Kk,r.

متن کامل

Connected matchings in chordal bipartite graphs

A connected matching in a graph is a collection of edges that are pairwise disjoint but joined by another edge of the graph. Motivated by applications to Hadwiger’s conjecture, Plummer, Stiebitz, and Toft [13] introduced connected matchings and proved that, given a positive integer k, determining whether a graph has a connected matching of size at least k is NPcomplete. Cameron [4] proved that ...

متن کامل

2-Factors in r-Connected {K1,k, P4}-Free Graphs

In [3], Faudree et.al. considered the proposition “Every {X, Y }-free graph of sufficiently large order has a 2-factor,” and they determined those pairs {X, Y } which make this proposition true. Their result says that one of them is {X, Y } = {K1,4, P4}. In this paper, we investigate the existence of 2-factors in r-connected {K1,k, P4}-free graphs. We prove that if r ≥ 1 and k ≥ 2, and if G is ...

متن کامل

(t, k)-Shredders in k-Connected Graphs

Let t, k be integers with t ≥ 3 and k ≥ 1. For a graph G, a subset S of V (G) with cardinality k is called a (t, k)-shredder if G−S consists of t or more components. In this paper, we show that if t ≥ 3, 2(t−1) ≤ k ≤ 3t−5 and G is a k-connected graph of order at least k, then the number of (t, k)-shredders of G is less than or equal to ((2t−1)(|V (G)|−f(|V (G)|)))/(2(t−1)), where f(n) denotes t...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Discrete Mathematics

سال: 2023

ISSN: ['1872-681X', '0012-365X']

DOI: https://doi.org/10.1016/j.disc.2022.113174